The traveling salesman problem is a favorite math conundrum : if a salesman has to visit a bunch of cities , how do you get him to all of them once via the shortest possible route .
斯蒂夫·米尔斯基报道。流动业务员问题是一个广受欢迎的数学难题：如果一个业务员要到一些城市开展业务，应该怎样安排行程，使他用最短的路程途经所有城市？
Math conundrum